The $$\mathbb {Q}$$ Q -curve Construction for Endomorphism-Accelerated Elliptic Curves

The Q-curve construction for endomorphism-accelerated elliptic curves

We give a detailed account of the use of Q-curve reductions to construct elliptic curves over Fp2 with efficiently computable endomorphisms, which can be used to accelerate elliptic curve-based cryptosystems in the same way as Gallant–Lambert–Vanstone (GLV) and Galbraith–Lin–Scott (GLS) endomorphisms. Like GLS (which is a degenerate case of our construction), we offer the advantage over GLV of ...

Elliptic Curves over Q

All polynomials and rational functions in this essay are assumed to have coefficients in Q . Fix an integer n ≥ 1. An affine variety is a simultaneous irreducible system of polynomial equations in n variables. The Q -points, R -points and C points of the affine variety are all solutions of the polynomial system in Q , R n and C , respectively. Rational projective n-spaceg Q n is the set of line...

Elliptic Curves over Q

$\mathbb{Z}_{q}(\mathbb{Z}_{q}+u\mathbb{Z}_{q})$-Linear Skew Constacyclic Codes

In this paper, we study skew constacyclic codes over the ring ZqR where R = Zq + uZq, q = p s for a prime p and u2 = 0. We give the definition of these codes as subsets of the ring ZqR . Some structural properties of the skew polynomial ring R[x, θ] are discussed, where θ is an automorphism of R. We describe the generator polynomials of skew constacyclic codes over R and ZqR. Using Gray images ...

ELLIPTIC CURVES OVER Q(i)

A study of the diophantine equation v2 = 2u4 − 1 led the authors to consider elliptic curves specifically over Q(i) and to examine the parallels and differences with the classical theory over Q. In this paper we present some extensions of the classical theory along with some examples illustrating the results. The well-known diophantine equation v2 = 2u4 − 1 , has, ignoring signs, only two integ...